Bid Price Optimization for Simultaneous Truckload Transportation Procurement Auctions
نویسندگان
چکیده
We study simultaneous transportation procurement auctions from a truckload carrier’s perspective. We formulate a stochastic bid price optimization problem with the objective of maximizing a carrier’s expected profit. The formulation takes into account the synergies among the lanes and the competing carriers’ bidding strategies. For solving this stochastic optimization problem, we develop an iterative coordinate search algorithm that finds good solutions efficiently. The effectiveness of the developed algorithm and the overall strategy is demonstrated through computational experiments.
منابع مشابه
Transportation Service Procurement Using Combinatorial Auction
Auction is a mechanism of selling distinct assets that can be both physical objects and virtual objects. Examples of virtual objects are the rights to use assets like airport time slots and FCC spectrum, or to service truckload delivery routes in a transportation network. Under some situations bidding on combinations of objects can render lower total price compare with bidding the objects one a...
متن کاملSimplified Bidding and Solution Methodology for Truckload Procurement and Other VCG Combinatorial Auctions
In theory, combinatorial auctions can provide significant benefits in many real-world applications, such as truckload procurement. In practice, however, the use of such auctions has been greatly limited by the need for bidders to bid on an exponential number of bundles and for the auctioneer to solve an exponentially large winner-determination problem. We address these challenges for VCG combin...
متن کاملDynamic threshold policy for delaying and breaking commitments in transportation auctions
In this paper we consider a transportation procurement auction consisting of shippers and carriers. Shippers offer time sensitive pickup and delivery jobs and carriers bid on these jobs. We focus on revenue maximizing strategies for shippers in sequential auctions. For this purpose we propose two strategies, namely delaying and breaking commitments. The idea of delaying commitments is that a sh...
متن کاملCarrier Bidding Strategies for Iterative Auctions for Transportation Services
Transportation service procurement auctions are typically characterized by limited number of rounds and low profit margin. In this paper we address the bid determination problem for single-lane and combinatorial bids in the successive rounds of an auction, which maximizes the profit and also ensures winning. A profit factor (PF) is computed at each round using the industry average price for thi...
متن کاملThe stochastic bid generation problem in combinatorial transportation auctions
In this paper, we deal with the generation of bundles of loads to be submitted by carriers participating in combinatorial auctions in the context of long-haul full truckload transportation services. We develop a probabilistic optimization model that integrates the bid generation and pricing problems together with the routing of the carrier’s fleet. We propose two heuristic procedures that enabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007